The structure of individual payo®s in superadditive coalitional games

نویسندگان

  • Glenn MacDonald
  • Michael D. Ryall
چکیده

n-player coalitional games with transferable payo® o®er a promising framework for analyzing value appropriation under competition. But making progress necessitates understanding how the force of a player's value-producing alternatives a®ects the upper and lower bounds of his set of equilibrium (core) payo®s. Unfortunately, there are virtually no results of this kind. We explore the determinants of the equilibrium payo®s of an individual player in such a game and, among other things, provide conditions necessary and su±cient for the lower bound on a player's equilibrium payo® to coincide with his reservation payo®. We also provide a parallel set of results on the upper bound. ¤We thank Adam Brandenburger, Leslie Marx, Joe Ostroy, Ariel Rubinstein and Phil Reny for thoughtful input.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The least core, kernel and bargaining sets of large games

We study the least core, the kernel and bargaining sets of coalitional games with a countable set of players. We show that the least core of a continuous superadditive game with a countable set of players is a nonempty (norm-compact) subset of the space of all countably additive measures. Then we show that in such games the intersection of the prekernel and the least core is non-empty. Finally,...

متن کامل

Balanced Nontransferable Utility Games in Graph Structure

By a game in coalitional structure or shortly coalitional game we mean the standard cooperative non-transferable utility game described by a nonempty set of payo®s for each coalition of players. It is well-known that balancedness is a su±cient condition for the nonemptiness of the core of such a cooperative non-transferable utility game. But any information on the internal organization of the c...

متن کامل

On Superadditivity and Convexity for Cooperative Games with Random Payoffs

In this paper we study the relations between superadditivity and several types of convexity for cooperative games with random payoffs. The types of convexity considered are marginal convexity (all marginal vectors belong to the core), individual-merge convexity (any individual player is better off joining a larger coalition) and coalitional-merge convexity (any coalition of players is better of...

متن کامل

Farsighted coalitional stability in TU-games

We study farsighted coalitional stability in the context of TUgames. Chwe (1994, p.318) notes that, in this context, it is difficult to prove nonemptiness of the largest consistent set. We show that every TU-game has a nonempty largest consistent set. Moreover, the proof of this result points out that each TU-game has a farsighted stable set. We go further by providing a characterization of the...

متن کامل

Multilateral Negotiations and Formation of Coalitions

This paper analyses properties of games modelling multilateral negotiations leading to the formation of coalitions in an environment with widespread externalities. The payo¤ generated by each coalition is determined by a set of exogenous parameters. We show that in almost all games, except in a set of measure zero of the parameter space, the Markov perfect equilibrium is locally unique and stab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002